A Note on Repeated-Root Cyclic Codes

In papers by Castagnoli et al. and Van Lint, cyclic codes with repeated roots are analyzed. Both papers fail to acknowledge a previous work by Chen, dating back to 1969, which includes an analysis of even, length binary cyclic codes. Results from Chen’s study are presented

Unequal Error Protection QPSK Modulation Codes

The authors use binary linear UEP (LUEP) codes, in combination with a QPSK signal set and Gray mapping, to obtain new efficient block QPSK modulation codes with unequal minimum squared Euclidean distances. They give several examples of codes that have the same minimum squared Euclidean distance as the best QPSK modulation codes of the same rate and length. A new suboptimal two-stage soft-decision decoding is applied to LUEP QPSK modulation codes

A Two-Stage Decoder for Pragmatic Trellis-Coded M-PSK Modulation Using a Symbol Transformation

A two-stage decoding procedure for pragmatic trellis-coded modulation (TCM) is introduced. It applies a transformation from the received I-channel and Q-channel samples onto points in a two-dimensional (2-D) signal space that contains a coset constellation. For pragmatic TCM over M-PSK signal sets with ν coded bits per symbol, ν=1, 2, the signal points in the coset constellations represent cosets of a B/QPSK signal subset-associated with the coded bits-in the original M-PSK signal constellation. A conventional Viterbi decoder operates on the transformed symbols to estimate the coded bits. After reencoding these bits, the uncoded bits are estimated in a second stage, on a symbol-by-symbol basis, with decisions based on the location of the received symbols. In addition to requiring no changes in the Viterbi decoder core, it is shown that the proposed method results in savings of up to 40% in the memory required to store (or in the size of the logic required to compute) metrics and transformed symbols

Block QPSK modulation codes with two levels of error protection

A class of block QPSK modulation codes for unequal error protection (UEP) is presented. These codes are particularly suitable either for broadcast channels or for communication systems where parts of the information messages are more important than others. An example of the latter is coded speech transmission. Not much is known on the application of block UEP codes in combined coding and modulation schemes. We exhibit a method to combine binary linear UEP (LUEP) block codes of even length, using a Gray mapping, with a QPSK signal set to construct efficient block QPSK modulation codes with nonuniform error protection capabilities for bandwidth efficient transmission over AWGN (additive white Gaussian noise) and Rayleigh fading channels

On the Error Performance of 8-VSB TCM Decoder for ATSC Terrestrial Broadcasting of Digital Television

The error performance of various 8-VSB TCM decoders for reception of terrestrial digital television is analyzed. In previous work, 8-state TCM decoders were proposed and implemented for terrestrial broadcasting of digital television. In this paper, the performance of a 16-state TCM decoder is analyzed and simulated. It is shown that not only a 16-state TCM decoder outperforms one with 8-states, but it also has much smaller error coefficients

On a Class of Optimal Nonbinary Linear Unequal-Error-Protection Codes for Two Sets of Messages

Several authors have addressed the problem of designing good linear unequal error protection (LUEP) codes. However, very little is known about good nonbinary LUEP codes. We present a class of optimal nonbinary LUEP codes for two different sets of messages. By combining t-error-correcting ReedSolomon (RS) codes and shortened nonbinary Hamming codes, we obtain nonbinary LUEP codes that protect one set of messages against any t or fewer symbol errors and the remaining set of messages against any single symbol error. For t ≥ 2, we show that these codes are optimal in the sense of achieving the Hamming lower bound on the number of redundant symbols of a nonbinary LUEP code with the same parameters

Concatenated Multilevel Coded Modulation Schemes for Digital Satellite Broadcasting

The error performance of bandwith-efficient concatenated multilevel coded modulation (MCM) schemes for digital satellite broadcasting is analyzed. Nonstandard partitioning, multistage decoding, and outer Reed-Solomon (RS) codes are employed to provided unequal error protection capabilities

Entity Ranking on Graphs: Studies on Expert Finding

Todays web search engines try to offer services for finding various information in addition to simple web pages, like showing locations or answering simple fact queries. Understanding the association of named entities and documents is one of the key steps towards such semantic search tasks. This paper addresses the ranking of entities and models it in a graph-based relevance propagation framework. In particular we study the problem of expert finding as an example of an entity ranking task. Entity containment graphs are introduced that represent the relationship between text fragments on the one hand and their contained entities on the other hand. The paper shows how these graphs can be used to propagate relevance information from the pre-ranked text fragments to their entities. We use this propagation framework to model existing approaches to expert finding based on the entity's indegree and extend them by recursive relevance propagation based on a probabilistic random walk over the entity containment graphs. Experiments on the TREC expert search task compare the retrieval performance of the different graph and propagation models

Binary Multilevel Convolutional Codes with Unequal Error Protection Capabilities

Binary multilevel convolutional codes (CCs) with unequal error protection (UEP) capabilities are studied. These codes belong to the class of generalized concatenated (GC) codes. Binary CCs are used as outer codes. Binary linear block codes of short length, and selected subcodes in their two-way subcode partition chain, are used as inner codes. Multistage decodings are presented that use Viterbi decoders operating on trellises with similar structure to that of the constituent binary CCs. Simulation results of example binary two-level CC\u27s are also reported

QPSK Block-Modulation Codes for Unequal Error Protection

Unequal error protection (UEP) codes find applications in broadcast channels, as well as in other digital communication systems, where messages have different degrees of importance. Binary linear UEP (LUEP) codes combined with a Gray mapped QPSK signal set are used to obtain new efficient QPSK block-modulation codes for unequal error protection. Several examples of QPSK modulation codes that have the same minimum squared Euclidean distance as the best QPSK modulation codes, of the same rate and length, are given. In the new constructions of QPSK block-modulation codes, even-length binary LUEP codes are used. Good even-length binary LUEP codes are obtained when shorter binary linear codes are combined using either the well-known |u¯|u¯+v¯|-construction or the so-called construction X. Both constructions have the advantage of resulting in optimal or near-optimal binary LUEP codes of short to moderate lengths, using very simple linear codes, and may be used as constituent codes in the new constructions. LUEP codes lend themselves quite naturally to multistage decoding up to their minimum distance, using the decoding of component subcodes. A new suboptimal two-stage soft-decision decoding of LUEP codes is presented and its application to QPSK block-modulation codes for UEP illustrated